Self-Organizing Approach to Graph Vertex Colouring in the Applications of Ad Hoc Networks

In this paper we propose a self-organizing method for the graph colouring problem. The proposed self-organizing method for the graph colouring extends the chemical casting model and makes it possible to find the number of colours needed to colour the graph. The self-organizing approach is needed to solve scheduling tasks in the applications of ad hoc networks. Nodes in ad hoc networks are usually not managed centrally and can use only local information. An ad hoc network can be considered as a self-organizing system where structure is created by local interactions between the system components without any external force responsible for it. The proposed method for the graph colouring takes into account the restrictions caused by the organization of ad hoc networks and shows good performance. Key-Words: self-organization, graph vertex colouring, ad hoc wireless network